Learning Generalized Nash Equilibria in a Class of Convex Games
نویسندگان
چکیده
منابع مشابه
Markov-Perfect Nash Equilibria in a Class of Resource Games
Ce document est publié dans l'intention de rendre accessibles les résultats préliminaires de la recherche effectuée au CIRANO, afin de susciter des échanges et des suggestions. Les idées et les opinions émises sont sous l'unique responsabilité des auteurs, et ne représentent pas nécessairement les positions du CIRANO ou de ses partenaires. This paper presents preliminary research carried out at...
متن کاملLearning Nash Equilibria in Non-Cooperative Games
Game Theory (Von Neumann & Morgenstern, 1944) is a branch of applied mathematics and economics that studies situations (games) where self-interested interacting players act for maximizing their returns; therefore, the return of each player depends on his behaviour and on the behaviours of the other players. Game Theory, which plays an important role in the social and political sciences, has rec...
متن کاملLearning Nash Equilibria in Congestion Games
We study the repeated congestion game, in which multiple populations of players share resources, and make, at each iteration, a decentralized decision on which resources to utilize. We investigate the following question: given a model of how individual players update their strategies, does the resulting dynamics of strategy profiles converge to the set of Nash equilibria of the one-shot game? W...
متن کاملOn Generalized Weight Nash Equilibria for Generalized Multiobjective Games
In this paper, we will introduce the general concepts of generalized multiobjective game, generalized weight Nash equilibria and generalized Pareto equilibria. Next using the fixed point theorems due to Idzik [5] and Kim-Tan [6], we shall prove the existence theorems of generalized weight Nash equilibria under general hypotheses. And as applications of generalized weight Nash equilibria, we sha...
متن کاملNash Equilibria in Discrete Routing Games with Convex Latency Functions
We study Nash equilibria in a discrete routing game that combines features of the two most famous models for non-cooperative routing, the KP model [16] and the Wardrop model [27]. In our model, users share parallel links. A user strategy can be any probability distribution over the set of links. Each user tries to minimize its expected latency, where the latency on a link is described by an arb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2019
ISSN: 0018-9286,1558-2523,2334-3303
DOI: 10.1109/tac.2018.2841319